Greedy routing via embedding graphs onto semi-metric spaces
نویسندگان
چکیده
منابع مشابه
Embedding Graphs onto the Supercube
In this paper we consider the Supercube, a new interconnection network derived from the hy-percube introduced by Sen in 10]. The Supercube has the same diameter and connectivity of a hypercube but can be realized for any number of nodes not only for powers of 2. We study the capabilities of the Supercube to execute parallel programs using graph{embedding techniques. We show that complete binary...
متن کاملHyperconvex Semi-metric Spaces
We examine the close analogy which exists between Helly graphs and hyperconvex metric spaces, and propose the hyperconvex semi-metric space as an unifying concept. Unlike the metric spaces, these semi-metric spaces have a rich theory in the discrete case. Apart from some new results on Helly graphs, the main results concern: fixed point property of contractible semi-metric spaces (for nonexpans...
متن کاملSemi-supervised deep learning by metric embedding
Deep networks are successfully used as classification models yielding state-ofthe-art results when trained on a large number of labeled samples. These models, however, are usually much less suited for semi-supervised problems because of their tendency to overfit easily when trained on small amounts of data. In this work we will explore a new training objective that is targeting a semi-supervise...
متن کاملGraph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between any pair of nodes in a graph, with only a partial knowledge of distances. Following this seminal work, a major challenge was to extend this model to larger classes of graphs than regular meshes, introducing the concept...
متن کاملEmbedding Finite Metric Spaces in Low Dimension
This paper presents novel techniques that allow the solution to several open problems regarding embedding of finite metric spaces into Lp. We focus on proving near optimal bounds on the dimension with which arbitrary metric spaces embed into Lp. The dimension of the embedding is of very high importance in particular in applications and much effort has been invested in analyzing it. However, no ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.049